Disputation Theory Applied To Disjunctive Logic Programs

نویسنده

  • Michael Thielscher
چکیده

The abstract framework of Disputation Theory is applied to disjunctive logic programs with nonmonotonic negation. This induces a particular semantics, which is proved equivalent to a recently proposed one that has been obtained via Argumentation Theory. The distinguishing feature of general Disputation Theory is an abstract scheme for skeptical proof methods, where entailment is established by modeling a formal dispute between two arguers. By suitably instantiating this scheme we obtain a goal-oriented and local proof procedure for propositional disjunctive logic programs. Our proof method is capable of processing arbitrary programs, in particular those with so-called head cycles , which are known to be notoriously di cult. Finally, we present an alternative mapping of disjunctive logic programs to disputation theories where disjunction in clause heads is read inclusive. In so doing, the general framework again delivers for free a particular semantics and proof procedure.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Relating Disjunctive Logic Programs to Default Theories

This paper presents the relationship between disjunctive logic programs and default theories. We rst show that Bidoit and Froidevaux's positivist default theory causes a problem in the presence of disjunctive information in a program. Then we present a correct transformation of disjunctive logic programs into default theories and show a one-to-one correspondence between the stable models of a p...

متن کامل

A Nonmonotonic Disputation-Based Semantics and Proof Procedure for Logic Programs

Logic programs with nonmonotonic negation are embedded in a general, abstract disputation-based framework for nonmonotonic logics. This formalization induces a particular semantics, which is proved to extend well-founded semantics and whose expanded expressiveness is illustrated by different examples involving reasoning by cases. Moreover, we develop a formal proof procedure for skeptical reaso...

متن کامل

On Extended Disjunctive Logic Programs

This paper studies, in a comprehensive manner, diierent aspects of extended disjunctive logic programs, that is, programs whose clauses are of the form l 1 not is the negation-by-default operator. The explicit use of classical negation suggests the introduction of a new truth value, namely, logical falsehood (in contrast to falsehood-by-default) in the semantics. General techniques are describe...

متن کامل

NORTH- HfRLAND PARTIAL DEDUCTION IN DISJUNCTIVE LOGIC PROGRAMMING

I> This paper presents a partial deduction method in disjunctive logic programming. Partial deduction in normal logic programs is based on unfolding between normal clauses, hence it is not applicable to disjunctive logic programs in general. Then we introduce a new partial deduction technique, called disjunctive partial deduction, which preserves the minimal model semantics of positive disjunct...

متن کامل

Semantics for Disjunctive Logic Programs with Explicit and Default Negation

The use of explicit negation enhances the expressive power of logic programs by providing a natural and unambiguous way to assert negated information about the domain being represented. We study the semantics of disjunctive programs that contain both explicit negation and negation-by-default, called extended disjunctive logic programs. General techniques are described for extending model, xpoin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998